Diophantine Equations
The Bézout Identity
Writing GCD of two numbers using only multiplication and addition.
Requirements:
Euclidean Algorithm
Difficulty:
2
Linear Diophantine Equations
Solving equations of the form $ax + by = c$.
Requirements:
The Bézout Identity
Difficulty:
2
Pythagorean Triples
Finding all right-angled triangles with integer sides.
Requirements:
Algebra
Difficulty:
2
Sums of Squares
Which numbers can be written as the sum of two squares? Or four?
Requirements:
Modular Arithmetic
Difficulty:
3
Fermat's Last Theorem
The story of a 350-year-old problem.
Requirements:
General Math
Difficulty:
1
⬅️ Back